NP-complete problems - PDFSEARCH.IO - Document Search Engine

NP-complete problems
Results: 1536

#	Item
351	6.889 — Lecture 15: Traveling Salesman (TSP) Christian Sommer (figures by Philip Klein) November 2, 2011 Traveling Salesman Problem (TSP) given G = (V, E) find a tour visiting each1 node v ∈ V . NP–har Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2011-11-29 11:50:24 Spanning tree NP-complete problems Operations research Travelling salesman problem Graph operations Minimum spanning tree Graph Planar graph Eulerian path Graph theory Theoretical computer science Mathematics
352	UC Berkeley—CS 170 Lecturer: David Wagner Problem Set 12 Due on May 13 at 3:30 p.m. Add to Reading List Source URL: www.cs.berkeley.edu Language: English - Date: 2015-01-21 19:48:42 NP-complete problems Complexity classes Mathematical optimization NP-complete P versus NP problem NP Time complexity Vertex cover Hamiltonian path Theoretical computer science Computational complexity theory Applied mathematics
353	Discrete Applied Mathematics–49 Annealed replication: a new heuristic for the maximum clique problem Immanuel M. Bomzea; ∗ , Marco Budinichb , Marcello Pelilloc , Claudio Rossic Add to Reading List Source URL: www.dais.unive.it Language: English - Date: 2002-12-03 08:21:13 NP-complete problems Functional languages Procedural programming languages Recursion Clique problem Mathematical optimization Clique Independent set Dynamical system Theoretical computer science Mathematics Applied mathematics
354	PDF Document Add to Reading List Source URL: web.eecs.umich.edu Language: English - Date: 2014-02-11 03:59:44 Combinatorial optimization NP-complete problems Matching Cut Shortest path problem Time complexity Maximum cut Travelling salesman problem Hungarian algorithm Theoretical computer science Graph theory Mathematics
355	BRICS Basic Research in Computer Science BRICS RSJ. M. Nielsen: On the Number of Maximal Independent Sets in a Graph On the Number of Maximal Independent Sets Add to Reading List Source URL: www.brics.dk Language: English - Date: 2002-04-12 04:11:55 NP-complete problems Maximal independent set Independent set Graph coloring Clique Extremal graph theory Domatic number Path decomposition Graph theory Theoretical computer science Mathematics
356	Mathematical Programming manuscript No. (will be inserted by the editor) Sanjeev Arora ? Add to Reading List Source URL: www.cs.duke.edu Language: English - Date: 2007-02-04 13:37:22 NP-complete problems Complexity classes Approximation algorithms Spanning tree Travelling salesman problem Polynomial-time approximation scheme Time complexity Optimization problem Algorithm Theoretical computer science Computational complexity theory Applied mathematics
357	CME 305: Discrete Mathematics and Algorithms Instructor: Reza Zadeh () HW#3 – Due at the beginning of class ThursdayConsider a model of a nonbipartite undirected graph in which two partic Add to Reading List Source URL: stanford.edu Language: English - Date: 2015-03-23 01:42:05 NP-complete problems Clique Travelling salesman problem Vertex cover NP-complete Cut Path decomposition Feedback vertex set Graph theory Theoretical computer science Mathematics
358	UC Berkeley—CS 170: Efficient Algorithms and Intractable Problems Lecturer: David Wagner Handout 23 May 1, 2003 Add to Reading List Source URL: www.cs.berkeley.edu Language: English - Date: 2015-01-21 19:48:42 NP-complete problems Complexity classes Bin packing problem NP Subset sum problem Partition problem Vertex cover Integer 3-partition problem Theoretical computer science Mathematics Computational complexity theory
359	arXiv:0909.2005v1 [cs.DS] 10 SepDeterministic approximation for the cover time of trees Uriel Feige∗ Add to Reading List Source URL: arxiv.org Language: English - Date: 2009-09-10 14:01:15 Analysis of algorithms SL Randomized algorithm Connectivity NP-complete problems Graph coloring Theoretical computer science Computational complexity theory Applied mathematics
360	Directing Complete Graphs and Avoiding Certain Structures January 31, 2015 The avoiding problem is defined as follows: the inputs consists of a simple Add to Reading List Source URL: payam-research.atwebpages.com Language: English - Date: 2015-01-31 03:24:13 NP-complete problems Morphisms Longest path problem Network theory Graph homomorphism Graph theory Theoretical computer science Mathematics

UPDATE